Gröbner Bases for Linearized Polynomials

نویسندگان

  • Margreta Kuijper
  • Anna-Lena Horlemann-Trautmann
چکیده

In this work we develop the theory of Gröbner bases for modules over the ring of univariate linearized polynomials with coefficients from a finite field.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Middle-Solving Grobner bases algorithm for cryptanalysis over finite fields

Algebraic cryptanalysis usually requires to recover the secret key by solving polynomial equations. Gröbner bases algorithm is a well-known method to solve this problem. However, a serious drawback exists in the Gröbner bases based algebraic attacks, namely, any information won’t be got if we couldn’t work out the Gröbner bases of the polynomial equations system. In this paper, firstly, a gener...

متن کامل

On Computing Gröbner Bases in Rings of Differential Operators with Coefficients in a Ring

Following the definition of Gröbner bases in rings of differential operators given by Insa and Pauer(1998), we discuss some computational properties of Gröbner bases arising when the coefficient set is a ring. First we give examples to show that the generalization of S-polynomials is necessary for computation of Gröbner bases. Then we prove that under certain conditions the G-S-polynomials can ...

متن کامل

Computing difference-differential dimension polynomials by relative Gröbner bases in difference-differential modules

In this paper we present a new algorithmic approach for computing the Hilbert function of a finitely generated difference-differential module equipped with the natural double filtration. The approach is based on a method of special Gröbner bases with respect to “generalized term orders” on Nm × Zn and on difference-differential modules. We define a special type of reduction for two generalized ...

متن کامل

A New Algorithm for Gröbner Bases and a New Application

In my PhD thesis 1965 and the subsequent publication 1970 in aequationes mathematicae, I introduced the notion of Gröbner bases and proved a charaterization theorem on which an algorithm for constructing Gröbner bases can be based. The characterization theorem states that a set F of multivariate polynomials (over a field) is a Gröbner bases iff all S-polynomials of F reduce to 0 w.r.t. F. The a...

متن کامل

SAGBI Bases Under Composition

Our interest in the subject of this paper is inspired by Hong (1998), where Hoon Hong addresses the problem of the behavior of Gröbner bases under composition of polynomials. More precisely, let Θ be a set of polynomials, as many as the variables in our polynomial ring. The question then is under which conditions on these polynomials it is true that for an arbitrary Gröbner basis G (with respec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1406.4600  شماره 

صفحات  -

تاریخ انتشار 2014